Papers with structured planning
CoPERLex: Content Planning with Event-based Representations for Legal Case Summarization (2025.findings-naacl)
Copied to clipboard
| Challenge: | Recent efforts to produce concise legal summarization have shifted towards abstractive approaches . |
| Approach: | They propose a framework that integrates content selection and planning components to generate coherent summaries based on both the content and the structured plan. |
| Outcome: | The proposed framework shows that it integrates content selection and planning components over entity-centric approaches in the context of legal judgements. |
SCAIR: Schema-Conditioned Agentic Iterative Reasoning for Enterprise Knowledge Graphs (2026.acl-industry)
Copied to clipboard
Prateek Chaturvedi, Yuqicheng Zhu, Hongkuan Zhou, Dongzhuoran Zhou, Yunjie He, Steffen Staab, Fei Du, Jie Tang, Evgeny Kharlamov
| Challenge: | Existing agentic approaches for Knowledge Graph-based Retrieval-Augmented Generation fail to generalize to real-world enterprise Knowledge graphs (KGs) dense, schema-driven, and operationally constrained, requiring a training-free framework. |
| Approach: | They propose a training-free framework that integrates structured planning with controlled iterative reasoning by injecting schema-conditioned structural priors and enforcing schemas during multi-hop reasoning. |
| Outcome: | The proposed framework significantly improves on a real-world enterprise-oriented benchmark constructed from a Configuration Management DataBase (CMDB). |
Generalizable LLM Learning of Graph Synthetic Data with Post-training Alignment (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing research has focused on enhancing graph reasoning capabilities of LLMs by supervised fine-tuning on synthetic graph data. |
| Approach: | They propose to unlock generalizable learning of graph with post-training alignment with synthetic graph data by aligning off-the-shelf LLMs and LLM fine-tuned on synthetic graphs. |
| Outcome: | The proposed algorithm improves on synthetic graph problems and out-of-domain tasks with implicit graph structures. |